Buuered Banks in Multiprocessor Systems
نویسندگان
چکیده
A memory design based on logical banks is analyzed for shared memory mul-tiprocessor systems. In this design, each physical bank is replaced by a logical bank consisting of a fast register and subbanks of slower memory. The subbanks are buuered by input and output queues which substantially reduce the eeective cycle time when the reference rate is below saturation. The principal contribution of this work is the development of a simple analytical model which leads to scaling relationships among the eeciency, the bank cycle time, the number of processors, the size of the buuers, and the granularity of the banks. These scaling relationships imply that if the interconnection network has suucient bandwidth to support eecient access using high-speed memory, then lower-speed memory can be substituted with little additional inter-connection cost. The scaling relationships are shown to hold for a full datapath vector simulation based on the Cray Y-MP architecture. The model is used to develop design criteria for a system which supports 192 independent reference streams, and the performance of this system is evaluated by simulation over a range of loading conditions.
منابع مشابه
Eeect of Non-uniform Traac on the Performance of Multistage Interconnection Networks
Multistage interconnection networks are used to connect processors to memories in shared memory multiprocessor systems. The performance evaluation of such networks is usually based on the assumption of uniform memory reference pattern. Hot spots in such networks give rise to non-uniform memory reference pattern and result in a degradation in performance. A comparison of performance between unbu...
متن کاملPerformance of Buuered Multistage Interconnection Networks in a Non Uniform Traac Environment 1
Multistage interconnection networks (MIN) are used to connect processors to memories in shared memory multiprocessor systems. They have also been proposed as switching fabrics in ATM switches in Broadband ISDN networks. A multistage network consists of several stages of switching elements (SE) connected by a permutation function. Since routing connicts among packets at the SEs cause blocking an...
متن کاملModel Comparison by Performance Evaluation of Multistage Interconnection Networks
Multistage Banyan networks are frequently proposed as connections in multiprocessor systems. There exist several studies to determine the performance of networks in which messages are unicasted. In this paper, the performance of buuered Banyan networks, in which messages may also be multicasted is determined using various models. These developed models , which are based on diierent modeling met...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995